Structural properties of Toeplitz graphs
نویسندگان
چکیده
In this paper, we study structural properties of Toeplitz graphs. We characterize Kq-free graphs for an integer q≥3 and give equivalent conditions a graph Gn〈t1,t2,…,tk〉 with t1<⋯<tk n≥tk−1+tk being chordal Gn〈t1,t2〉 perfect. Then compute the edge clique cover number vertex graph. Finally, degree sequence (d1,d2,…,dn) n vertices show that is regular if only it circulant
منابع مشابه
Structural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملHamiltonian properties of Toeplitz graphs
Condit ions are given for the existence of hamiltonian paths and cycles in the so-called Toeplitz graphs, i.e. simple graphs with a symmetric Toeplitz adjacency matrix.
متن کاملstructural properties of fuzzy graphs
matroids are important combinatorial structures and connect close-lywith graphs. matroids and graphs were all generalized to fuzzysetting respectively. this paper tries to study connections betweenfuzzy matroids and fuzzy graphs. for a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. a fuzzy matroid, named graph fuzzy matro...
متن کاملStructural Properties of Sparse Graphs
Dense graphs have been extensively studied in the context of Extremal Graph Theory. The outstanding Szemerédi Regularity Lemma [111] states that any dense network has properties which are close to the ones of a random graph. In particular, a large dense network cannot be too irregular. This structural result is one of the cornerstones of contemporary combinatorics (and one would like to say mat...
متن کاملOn Planar Toeplitz Graphs
We describe several classes of finite, planar Toeplitz graphs and present results on their chromatic number. We then turn to counting maximal independent sets in these graphs and determine recurrence equations and generating functions for some special cases.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2022
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.113016